A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
نویسنده
چکیده
منابع مشابه
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem
We present the rst truly polynomial-time approximation scheme (PTAS) for the minimum-cost k-vertex-(or, k-edge-) connected spanning subgraph problem for complete Euclidean graphs in R d : Previously it was known for every positive constant " how to construct in a polynomial time a graph on a superset of the input points which is k-vertex connected with respect to the input points, and whose cos...
متن کاملA Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact size k in time O(1) and a cut of size k in time linear in its size. For the minimum edge cut problem and for any 0 < 1, the amortized time per insertion is O(1= ) for a (2 + )-approximation,...
متن کاملApproximation Algorithms for k-Connected Graph Factors
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of minimum weight with connectivity requirements. For the case of k-edge-connectedness, we present approximation algorithms that achieve constant approximation ratios for all d ≥...
متن کاملA Static 2-Approximation Algorithm for Vertex Connectivity and Imcremental Approximation Algorithms for Edge and Vertex Connectivity
This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact size k in time O(1) and a cut of size k in time linear in its size. For the minimum edge cut problem and for any 0 < 1, the amortized time per insertion is O(1== 2) for a (2 +)-approximation...
متن کاملNetwork Design Via Iterative Rounding Of Setpair Relaxations
A typical problem in network design is to nd a minimum-cost sub-network H of a given network G such that H satisses some prespeciied connectivity requirements. Our focus is on approximation algorithms for designing networks that satisfy vertex connectivity requirements. Our main tool is a linear programming relaxation of the following setpair formulation due to Frank and Jordan: a setpair consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001